Expressive Completeness of Duration Calculus
نویسندگان
چکیده
منابع مشابه
Expressive Completeness of Duration Calculus
This paper compares the expressive power of first-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of the Propositional version of Duration Calculus (PDC), a formalism for the specification of realtime systems. Our results show that the propositional duration calculus is expressively complete for first-order monadic logic of or...
متن کاملA Higher-Order Duration Calculus and Its Completeness
This paper studies how to describe the real-time behaviour of programs using Duration Calculus. Since program variables are interpreted as functions over time in real-time programming, and it is inevitable to introduce quantifications over program variables in order to describe local variable declaration and declare local channel and so on, therefore, to establish a higher-order duration calcul...
متن کاملCompleteness and Decidability of a Fragment of Duration Calculus with Iteration Completeness and Decidability of a Fragment of Duration Calculus with Iteration
The mission of UNU/IIST is to assist developing countries in the application and development of software technology. UNU/IIST contributes through its programmatic activities: 1. advanced development projects in which software techniques supported by tools are applied, 2. research projects in which new techniques for software development are investigated, 3. curriculum development projects in wh...
متن کاملOn the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic
Monadic second order logic (MSOL) over transition systems is considered. It is shown that every formula of MSOL which does not distinguish between bisimilar models is equivalent to a formula of the propo-sitional-calculus. This expressive completeness result implies that every logic over transition systems invariant under bisimulation and translat-able into MSOL can be also translated into the-...
متن کاملOn the Expressive Completeness of Underspecified Representations
One property of underspecified representation formalisms is that of expressive completeness, i.e. the ability to provide representations for all possibly occuring sets of readings. In this paper a general and formal definition of completeness along the lines of [6] will be given. Several formalisms will then be compared concerning their expressive power and shown to be incomplete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2000
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2816